Decomposition of Target Coverage Graph in Wireless Sensor Network
نویسندگان
چکیده
منابع مشابه
Decomposition of Target Coverage Graph in Wireless Sensor Network
In order to reduce the algorithm complexity of the target coverage problem in Wireless Sensor Network, three kinds of approaches are designed to decrease the network scale, that is, one is deleting the redundant sensor nodes, another is removing the redundant targets, and the third is decomposing the target coverage graph into multiple independent sub graphs. This paper proves that the three ap...
متن کاملEnergy Efficient Target Coverage Issues in Wireless Sensor Network
A critical aspect of applications in wireless sensor network is network lifetime. Wireless sensor network are usable as long as they can communicate sensed data to processed node. Sensing and communication are important activities and they consume energy. So power management and sensor scheduling can effectively increase the networks lifetime. There are many issues that can be considered for en...
متن کاملEnergy Efficient Target Coverage in wireless Sensor Network
Sensor networks have been applied in a wide variety of situations. Recently directional sensor networks consisting of directional sensors have gained attention. Network life is very crucial parameter for sensor network. In this paer, we use artificial intelligence to deploy sensor node with objective of maximize life of network. Simulation results shows that proposed method perform well. Key Wo...
متن کاملSome Target Coverage Issues of Wireless Sensor Network
Recent improvements in technologies have a considerable impaction advancing the state of wireless sensor networks, which constitute the platform of broad range of applications related to national Security, Habitat Monitoring, Environment observation and forecasting, Health Applications, Home and Office Applications. An important problem receiving increased consideration recently is the target c...
متن کاملImproving Energy-Efficient Target Coverage in Visual Sensor Networks
Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Electrical & Electronic Engineering Journal
سال: 2014
ISSN: 1874-1290
DOI: 10.2174/1874129001408010567